Spectral moments of trees with given degree sequence
نویسندگان
چکیده
منابع مشابه
Spectral moments of trees with given degree sequence
Article history: Received 16 April 2013 Accepted 11 October 2013 Available online 30 October 2013 Submitted by R. Brualdi MSC: 05C05 05C50 05C35
متن کاملLexicographical ordering by spectral moments of trees with a given bipartition
Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this paper. For two given positive integers $p$ and $q$ with $pleqslant q$, we denote $mathscr{T}_n^{p, q}={T: T$ is a tree of order $n$ with a $(p, q)$-bipartition}. Furthermore, the last four trees, in the $S$-order, among $mathscr{T}_n^{p, q},(4leqslant pleqslant q)$ are characterized.
متن کاملlexicographical ordering by spectral moments of trees with a given bipartition
lexicographic ordering by spectral moments ($s$-order) among all trees is discussed in this paper. for two given positive integers $p$ and $q$ with $pleqslant q$, we denote $mathscr{t}_n^{p, q}={t: t$ is a tree of order $n$ with a $(p, q)$-bipartition}. furthermore, the last four trees, in the $s$-order, among $mathscr{t}_n^{p, q},(4leqslant pleqslant q)$ are characterized.
متن کاملThe Number of Subtrees of Trees with Given Degree Sequence
This article investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalize the recent results of Kirk and Wang (SIAM J Discrete Math 22 (2008), 985–995). These trees coincide with those which were proven by Wang and independently Z...
متن کاملTrees with given maximum degree minimizing the spectral radius
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let T (n,∆, l) be the tree which minimizes the spectral radius of all trees of order n with exactly l vertices of maximum degree ∆. In this paper, T (n,∆, l) is determined for ∆ = 3, and for l ≤ 3 and n large enough. It is proven that for sufficiently large n, T (n, 3, l) is a caterpillar with (almost...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.10.019